Answer Set Programming and Combinatorial Voting
نویسنده
چکیده
In this paper Logic Programming with Ordered Disjunction (LPOD), an extension of answer set programming for handling preferences, is used for representing and solving combinatorial vote problems. Various vote rules, used as procedures for determining optimal candidate for a group of voters, are defined by means of preference relations between answer sets of a program, representing a vote problem. Moreover, we present lexicographic extensions of some vote procedures, making these procedures more decisive.
منابع مشابه
Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers
We consider voting over combinatorial domains, where alternatives are binary tuples. We assume that votes are specified as conditionally lexicographic preferences, or LP trees. We study aggregation problems of LP tree votes for several positional scoring rules. Our main goal is to demonstrate that answer-set programming can be effective in solving the winner and the evaluation problems for inst...
متن کاملA qualitative model of automated decision making: the answer set programming approach
In the field of decision making, there are two main groups of approaches: quantitative (classical) models and qualitative models of decision making. The former group relies on the notions of utility and probability as representations of a decision maker preferences and beliefs. The latter applies qualitative counterparts of these functions, where the numbers reflect nothing more than positions ...
متن کاملVoting Theory in Answer Set Programming
In this paper, we combine answer set programming with voting theory for the first time. For this, we use the voting procedures defined in [5], which allow winner determination under incomplete preference relations. We present the problem of scheduling a meeting for a research group as an application. In those scheduling problems, often no meetings are schedulable because of conflicting unavaila...
متن کاملA two phases approach for discriminating efficient candidate by using DEA inspired procedure
There are several methods to ranking DMUs in Data Envelopment Analysis (DEA) and candidates in voting system. This paper proposes a new two phases method based on DEA’s concepts. The first phase presents an aspiration rank for each candidate and second phase propose final ranking.
متن کاملSketched Answer Set Programming
Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models is not trivial. We propose a novel method, called Sketched Answer Set Programming (SkASP), aiming at supporting the user in resolving this issue. The user writes an ASP program while marking uncertain parts open with question marks. In addition, the user provides a number of pos...
متن کامل